Event Calculus with Explicit Quantifiers
نویسندگان
چکیده
Kowalski and Sergot’s Event Calculus (EC ) is a simAppeared in the Proceedings of the Fifth International Workshop on Temporal Representation and Reasoning — TIME’98 (R. Morris, L. Khatib editors), pp. 81–88, IEEE Computer Society Press, Sanibel Island, FL, 16–17 May 1998. ple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which properties initiated or terminated by these events hold. We extend the range of queries accepted by EC, so far limited to boolean combinations of MVI verification or computation requests, to admit arbitrary quantification over events and properties. We demonstrate the added expressive power by encoding a medical diagnosis problem as a case study. Moreover, we give an implementation of this formalism and analyze the computational complexity of the extended calculus.
منابع مشابه
The Complexity of Model Checking in Modal Event Calculi with Quantifiers
Kowalski and Sergot’s Event Calculus (EC ) is a simple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which properties initiated or terminated by these events hold. It does so in polynomial time with respect to the number of events. Extensions of its query language with Boolean connectives and operators from modal logic have been sh...
متن کاملBack to the Future: Explicit Logic for Computer Science
We will speak about three traditions in Logic: • Classical, usually associated with Frege, Hilbert, Gödel, Tarski, and others; • Intuitionistic, founded by Brouwer, Heyting, Kolmogorov, Gödel, Kleene, and others; • Explicit, which we trace back to Skolem, Curry, Gödel, Church, and others. The classical tradition in logic based on quantifiers ∀ and ∃ essentially reflected the 19th century mathem...
متن کاملPrivate Names in Non-Commutative Logic
We present an expressive but decidable first-order system (named MAV1) defined by using the calculus of structures, a generalisation of the sequent calculus. In addition to first-order universal and existential quantifiers the system incorporates a pair of nominal quantifiers called ‘new’ and ‘wen’, distinct from the self-dual Gabbay-Pitts and Miller-Tiu nominal quantifiers. The novelty of thes...
متن کاملType Checking and Inference for Polymorphic and Existential Types in Multiple-Quantifier and Type-Free Systems
A multiple quantifier is a quantifier having inference rules that introduce or eliminate arbitrary number of quantifiers by one inference. This paper introduces the lambda calculus with negation, conjunction, and multiple existential quantifiers, and the lambda calculus with implication and multiple universal quantifiers. Their type checking and type inference are proved to be undecidable. This...
متن کاملSystem f2lp - Computing Answer Sets of First-Order Formulas
We present an implementation of the general language of stable models proposed by Ferraris, Lee and Lifschitz. Under certain conditions, system f2lp turns a first-order theory under the stable model semantics into an answer set program, so that existing answer set solvers can be used for computing the general language. Quantifiers are first eliminated and then the resulting quantifier-free form...
متن کامل